Generalizations of Ostrowski inequality via biparametric Euler harmonic identities for measures

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New time scale generalizations of the Ostrowski-Grüss type inequality for k points

Two Ostrowski-Grüss type inequalities for k points with a parameter [Formula: see text] are hereby presented. The first generalizes a recent result due to Nwaeze and Tameru, and the second extends the result of Liu et al. to k points. Many new interesting inequalities can be derived as special cases of our results by considering different values of λ and [Formula: see text]. In addition, we app...

متن کامل

An Inequality of Ostrowski Type via Pompeiu’s Mean Value Theorem

 (b− a)M, for all x ∈ [a, b] . The constant 14 is best possible in the sense that it cannot be replaced by a smaller constant. In [2], the author has proved the following Ostrowski type inequality. Theorem 2. Let f : [a, b] → R be continuous on [a, b] with a > 0 and differentiable on (a, b) . Let p ∈ R\ {0} and assume that Kp (f ) := sup u∈(a,b) { u |f ′ (u)| } < ∞. Then we have the inequality...

متن کامل

Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy

In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed, which is closely related to Euler’s famous theorem that the number of partitions of n into odd parts equals the number of partitions of n into distinct parts. We consider extensions of Guy’s result, which naturally l...

متن کامل

Harmonic Number Identities Via Euler’s Transform

We evaluate several binomial transforms by using Euler's transform for power series. In this way we obtain various binomial identities involving power sums with harmonic numbers.

متن کامل

Euler-type Identities for Integer Compositions via Zig-zag Graphs

This paper is devoted to a systematic study of combinatorial identities which assert the equality of different sets of compositions, or ordered partitions, of integers. The proofs are based on properties of zig-zag graphs the graphical representations of compositions introduced by Percy A. MacMahon in his classic book Combinatory Analysis. In particular it is demonstrated, by means of general t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Banach Journal of Mathematical Analysis

سال: 2010

ISSN: 1735-8787

DOI: 10.15352/bjma/1272374679